/**
 * Given n, how many structurally unique BST's (binary search trees) that store values 1...n?
 * For example,Given n = 3, there are a total of 5 unique BST's.
 */
/**
 * @author Ivan
 *
 */
package problem96_Unique_Binary_Search_Trees;